reasoning procedure

См. также в других словарях:

• Case-based reasoning — (CBR), broadly construed, is the process of solving new problems based on the solutions of similar past problems. An auto mechanic who fixes an engine by recalling another car that exhibited similar symptoms is using case based reasoning. A… …   Wikipedia

• PRACTICE AND PROCEDURE — CIVIL Court Sessions The courts of three (judges) exercising jurisdiction in civil matters (see bet din ) held their sessions during the day, but – following Jethro s advice to Moses that judges should be available at all times (Ex. 18:22) – they …   Encyclopedia of Judaism

• Defeasible reasoning — is a kind of reasoning that is based on reasons that are defeasible, as opposed to the indefeasible reasons of deductive logic. Defeasible reasoning is a particular kind of non demonstrative reasoning, where the reasoning does not produce a full …   Wikipedia

• Automated reasoning — is an area of computer science dedicated to understand different aspects of reasoning. The study in automated reasoning helps produce software which allows computers to reason completely, or nearly completely, automatically. Although automated… …   Wikipedia

• Abductive reasoning — Abduction, or inference to the best explanation, is a method of reasoning in which one chooses the hypothesis that would, if true, best explain the relevant evidence. Abductive reasoning starts from a set of accepted facts and infers their most… …   Wikipedia

• Case Based Reasoning — Raisonnement par cas Pour les articles homonymes, voir CBR. Pour résoudre les problèmes de la vie quotidienne, nous faisons naturellement appel à notre expérience. Nous nous remémorons les situations semblables déjà rencontrées. Puis nous les… …   Wikipédia en Français

• diagonal procedure — The method first used by Cantor to show that there cannot be an enumeration of the real numbers. Any real number can be written as an infinite decimal. So we imagine a correspondence with the natural numbers, giving us some real as the first,… …   Philosophy dictionary

• Proof complexity — In computer science, proof complexity is a measure of efficiency of automated theorem proving methods that is based on the size of the proofs they produce. The methods for proving contradiction in propositional logic are the most analyzed. The… …   Wikipedia

• процедура обоснования — — [Л.Г.Суменко. Англо русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.] Тематики информационные технологии в целом EN reasoning procedure …   Справочник технического переводчика

• History of logic — Philosophy ( …   Wikipedia

• artificial intelligence — the capacity of a computer to perform operations analogous to learning and decision making in humans, as by an expert system, a program for CAD or CAM, or a program for the perception and recognition of shapes in computer vision systems. Abbr.:… …   Universalium